Finding the Minimum Number of Face Guards is NP-Hard

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Wireless Localization with Vertex Guards is NP-hard

We consider a special class of art gallery problems inspired by wireless localization. Given a simple polygon P , place and orient guards each of which broadcasts a unique key within a fixed angular range. In contrast to the classical art gallery setting, broadcasts are not blocked by the boundary of P . At any point in the plane one must be able to tell whether or not one is located inside P o...

متن کامل

Forbidden Configurations: Finding the number predicted by the Anstee-Sali Conjecture is NP-hard

Let F be a hypergraph and let forb(m,F ) denote the maximum number of edges a hypergraph with m vertices can have if it doesn’t contain F as a subhypergraph. A conjecture of Anstee and Sali predicts the asymptotic behaviour of forb(m,F ) for fixed F . In this paper we prove that even finding this predicted asymptotic behaviour is an NP-hard problem, meaning that if the Anstee-Sali conjecture we...

متن کامل

Finding the smallest binarization of a CFG is NP-hard

Grammar binarization is the process and result of transforming a grammar to an equivalent form whose rules contain at most two symbols in their right-hand side. Binarization is used, explicitly or implicity, by a wide range of parsers for contextfree grammars and other grammatical formalisms. Non-trivial grammars can be binarized in multiple ways, but in order to optimize the parser’s computati...

متن کامل

Finding a minimum medial axis of a discrete shape is NP-hard

The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may exist without changing the reversivility of the input shape representation. In this article, we first prove that finding a minimum medial axis is an NP-hard problem for the Euclidean distance. Then, we compare two algo...

متن کامل

The Minimum Latency Problem Is NP-Hard for Weighted Trees

In the minimum latency problem (MLP) we are given n points v1, . . . , vn and a distance d(vi, vj) between any pair of points. We have to find a tour, starting at v1 and visiting all points, for which the sum of arrival times is minimal. The arrival time at a point vi is the traveled distance from v1 to vi in the tour. The minimum latency problem is MAX-SNP-hard for general metric spaces, but t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEICE Transactions on Information and Systems

سال: 2012

ISSN: 0916-8532,1745-1361

DOI: 10.1587/transinf.e95.d.2716